Search results
15 packages found
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
- bloom
- filter
- bloom filter
- probabilistic
- datastructure
- partitionned bloom filter
- scalable bloom filter
- counting bloom filter
- invertible bloom filter
- count min sketch
- cuckoo
- xor
- minhash
- top-k
Space efficient bloom filter based on the bloom-filters npm package.
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
Space efficient bloom filter based on the bloom-filters npm package.
Ability to test bloom filters for ethereum.
Bloom filters for javascript
bloom filters backed by xxhash
JS implementation of Bloom Filter using FastBitSet.js
- bloom
- filter
- bloom filter
- invertible bloom filter
- probabilistic
- datastructure
- count min sketch
- cuckoo
- bitset
Bitcoin connection Bloom filtering (BIP37)
Golomb-coded sets (GCS) is a probabilistic data structure conceptually similar to the famous Bloom filters, but with a more compact in-memory representation, and a slower query time.
Golomb-coded sets (GCS) is a probabilistic data structure conceptually similar to the famous Bloom filters, but with a more compact in-memory representation, and a slower query time.
bloom filters backed by xxhash
Bloom filters for javascript